An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications
نویسنده
چکیده
Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specifications into implementations that execute against persistent databases. The foundation of Alchemy is an algorithm for rewriting relational algebra formulas into code for database transactions. In this paper we report on recent progress in improving the robustness and efficiency of this transformation.
منابع مشابه
Pre - proceedings 10 th International Workshop on Rule - Based Programming RULE 2009
Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler,Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specificationsinto implementations that execute against persistent databases. The foundation of Alchemy is an algorithmfor rewriting relational algebra formulas into code for database transacti...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملRelational Approach to Boolean Logic Problems
We present a method for specifying and implementing algorithms for Boolean logic problems. It is formally grounded in relational algebra. Specifications are written in first-order set theory and then transformed systematically into relation-algebraic forms which can be executed directly in RelView, a computer system for the manipulation of relations and relational programming. Our method yields...
متن کاملSynthesizing Information Systems: the APIS Project
This article presents the main features of the APIS project that addresses the rapid development of information systems from formal specifications. Information systems are specified using EB, a trace-based formal language. The sequences of input events accepted by the system are described with a process algebra; they represent the valid traces of the information system. Entity types, associatio...
متن کاملInformation Algebras and Consequence Operators
We explore a connection between different ways of representing information in computer science. We show that relational databases, modules, algebraic specifications and constraint systems all satisfy the same ten axioms. A commutative semigroup together with a lattice satisfying these axioms is then called an “information algebra”. We show that any compact consequence operator satisfying the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009